Universally Ideal Secret Sharing Schemes
نویسندگان
چکیده
17 graph. The cuts of G are the minimal dependent sets of a matroid T ? (G) on the edge set E. A matroid T is cographic if there exists some graph G such that T is isomorphic to the cut matroid T ? (G). Every cographic matroid is representable over any eld 18]. Therefore if an access structure A has a cographic appropriate matroid, then A is universally ideal. Unlike graphic matroids, we do not know of a simple construction of universally ideal secret sharing schemes for cographic matroids.
منابع مشابه
Universally ideal secret-sharing schemes
Abstmct-Given a set of parties {l,. , n ) , an access structure is a monotone collection of subsets of the parties. For a certain domain of secrets, a secret-sharing scheme for an access structure is a method for a dealer to distribute shares to the parties. These shares enable subsets in the access structure to reconstruct the secret, while subsets not in the access structure get no informatio...
متن کاملSecurity Analysis of a Hash-Based Secret Sharing Scheme
Secret sharing schemes perform an important role in protecting se-cret by sharing it among multiple participants. In 1979, (t; n) threshold secret sharing schemes were proposed by Shamir and Blakley independently. In a (t; n) threshold secret sharing scheme a secret can be shared among n partic-ipants such that t or more participants can reconstruct the secret, but it can not be reconstructed b...
متن کاملComputationally secure multiple secret sharing: models, schemes, and formal security analysis
A multi-secret sharing scheme (MSS) allows a dealer to share multiple secrets among a set of participants. in such a way a multi-secret sharing scheme (MSS) allows a dealer to share multiple secrets among a set of participants, such that any authorized subset of participants can reconstruct the secrets. Up to now, existing MSSs either require too long shares for participants to be perfect secur...
متن کاملIdeal Secret Sharing Schemes: Yet Another Combinatorial Characterization, Certain Access Structures, and Related Geometric Problems
An ideal secret sharing scheme is a method of sharing a secret key in some key space among a finite set of participants in such a way that only the authorized subsets of participants can reconstruct the secret key from their shares which are of the same length as that of the secret key. The set of all authorized subsets of participants is the access structure of the secret sharing scheme. In th...
متن کاملSETUP in secret sharing schemes using random values
Secret sharing schemes divide a secret among multiple participants so that only authorized subsets of parties can reconstruct it. We show that SETUP (Secretly Embedded Trapdoor with Universal Protection) attack can be embedded in secret sharing schemes that employ enough randomness to give the attacker an overwhelming advantage to access the secret. In case of ideal schemes, a coalition of a fe...
متن کامل